A note on the set union knapsack problem
نویسندگان
چکیده
منابع مشابه
A note on polyhedral aspects of a robust knapsack problem
The robust optimization framework proposed by Bertsimas and Sim can take account of data uncertainty in linear programs. The current paper investigates the polyhedral impacts of this robust model for the 0-1 knapsack problem. In particular, classical cover cuts are adapted to provide valid inequalities for the robust knapsack problem. The strength of the proposed inequalities is highlighted fro...
متن کاملNote on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e., a non-unitary, proper subset H of a graph’s vertices such that all vertices in H have the same neighbors outside H . Given two graphs G1(V ,E1), G2(V ,E2), the Homogeneous Set Sandwich Problem asks whether there exists a sandwich graph GS(V,ES), E1 ⊆ES ⊆E2, which has a homogeneous set. Recently, Tang et al. [Inform. Process. Lett. 77 (...
متن کاملA Set-Oriented Genetic Algorithm and the Knapsack Problem
Genetic Algorithms (GAS) have been used to solve the NP-complete problems effectively such as the knapsack problem. One difficulty in applying GA to the knapsack problem is that the bit string representation of the canonical GA chromosome does not provide the direct mapping of the problem into the GA chromosome. In this paper, a new chromosome representation of the GA is proposed which is calle...
متن کاملThe Set Union Problem With Unlimited Backtracking
An extension of the disjoint set union problem is considered, where the extra primitive backtrack(i) can undo the last i unions not yet undone. Let n be the total number of elements in all the sets. A data structure is presented that supports each union and find in O(lognj loglogn) worst-case time and each backtrack(i) in 0(1) worst-case time, irrespective of i. The total space required by the ...
متن کاملA note on the generalized min-sum set cover problem
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin [1]. Bansal, Gupta, and Krishnaswamy [2] give a 485approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.12.015